Search results for "discrete [space-time]"

Radó-Kneser-Choquet Theorem for simply connected domains (p-harmonic setting)

2018

A remarkable result known as Rad´o-Kneser-Choquet theorem asserts that the harmonic extension of a homeomorphism of the boundary of a Jordan domain ⌦ ⇢ R2 onto the boundary of a convex domain Q ⇢ R2 takes ⌦ di↵eomorphically onto Q . Numerous extensions of this result for linear and nonlinear elliptic PDEs are known, but only when ⌦ is a Jordan domain or, if not, under additional assumptions on the boundary map. On the other hand, the newly developed theory of Sobolev mappings between Euclidean domains and Riemannian manifolds demands to extend this theorem to the setting on simply connected domains. This is the primary goal of our article. The class of the p -harmonic equations is wide enou…

Weakly compact composition operators between algebras of bounded analytic functions

1999

Lattice property of $p$-admissible weights

2015

$(BV,L^p)$-decomposition, $p=1,2$, of Functions in Metric Random Walk Spaces

2019

In this paper we study the $(BV,L^p)$-decomposition, $p=1,2$, of functions in metric random walk spaces, a general workspace that includes weighted graphs and nonlocal models used in image processing. We obtain the Euler-Lagrange equations of the corresponding variational problems and their gradient flows. In the case $p=1$ we also study the associated geometric problem and the thresholding parameters.

Set-Valued Generalizations of Baire′s Category Theorem

1995

Abstract We prove some generalizations of Baire′s category theorem for chains of iterates of multifunctions defined on Cech-complete spaces. In particular, we extend Lennard′s results stated for functions on complete metric spaces.

Generic unfoldings with the same bifurcation diagram which are not (C0, C0)— equivalent

1997

A decidable word problem without equivalent canonical term rewriting system

1989

We present a weak associative single-axiom system having the following property: the word problem is decidable with an efficient algorithm even though there does not exist any finite equivalent canonical term rewriting system.

Erratum to “Testing for selectivity in the dependence of random variables on external factors” [J. Math. Psych. 52 (2008) 128–144]

2010

Grundy coloring for power graphs

2003

International audience

Partially Square Graphs, Hamiltonicity and Circumference II

2000

Abstract Given a graph G, its partially square graph G∗ is a graph obtained by adding an edge uv for each pair u, v of vertices of G at distance 2 whenever the vertices u and v have a common neighbor x satisfying the condition NG(x) ⊆ NG[u] ∪ NG[v], where NG[x]= NG(x) ∪ {x}. In case G is a claw-free graph, G∗ is equal to G2, We define σ ∗ t = min{ ∑ x∈ d ∗ G (x): S is an independent set in G ∗ and ∣S∣ = t} , where d ∗ G (x) = ∣{y ∈ V∣ xy ∈ E(G∗)}∣ . We give for hamiltonicity and circumference new sufficient conditions depending on and we improve some known results.